Superscalar Coprocessor for High-Speed Curve-Based Cryptography
نویسندگان
چکیده
We propose a superscalar coprocessor for high-speed curvebased cryptography. It accelerates scalar multiplication by exploiting instruction-level parallelism (ILP) dynamically and processing multiple instructions in parallel. The system-level architecture is designed so that the coprocessor can fully utilize the superscalar feature. The implementation results show that scalar multiplication of Elliptic Curve Cryptography (ECC) over GF(2), Hyperelliptic Curve Cryptography (HECC) of genus 2 over GF(2) and ECC over a composite field, GF((2)) can be improved by a factor of 1.8, 2.7 and 2.5 respectively compared to the case of a basic single-scalar architecture. This speed-up is achieved by exploiting parallelism in curve-based cryptography. The coprocessor deals with a single instruction that can be used for all field operations such as multiplications and additions. In addition, this instruction only allows one to compute point/divisor operations. Furthermore, we provide also a fair comparison between the three curve-based cryptosystems.
منابع مشابه
High speed and Low space complexity FPGA based ECC processor
Elliptic Curve Cryptography is one of the most interested research topic in VLSI. Network security is becoming more and more crucial as the volume of data being exchanged on the Internet increases. ECC offers high security for networking and communication. FPGA based architecture for elliptic curve cryptography coprocessor ,which has promising performance in terms of both Space Complexity and T...
متن کاملA Fast and Compact FPGA Implementation of Elliptic Curve Cryptography Using Lambda Coordinates
Elliptic curve cryptography (ECC) provides high security with shorter keys than other public-key cryptosystems and it has been successfully used in security critical embedded systems. We present an FPGA-based coprocessor that communicates with the host processor via a 32-bit bus. It implements ECC over an elliptic curve that offers roughly 128-bit security. It is the first hardware implementati...
متن کاملArea Flexible GF(2k) Elliptic Curve Cryptography Coprocessor
Elliptic curve cryptography (ECC) is popularly defined either over GF(p) or GF(2 k). This research modifies a GF(p) multiplication algorithm to make it applicable for GF(2 k). Both algorithms, the GF(p) and GF(2 k) one, are designed in hardware to be compared. The GF(2 k) multiplier is found faster and small. This GF(2 k) multiplier is further improved to benefit in speed, it gained more than 4...
متن کاملProgrammable and Parallel ECC Coprocessor Architecture: Tradeoffs between Area, Speed and Security
Elliptic Curve Cryptography implementations are known to be vulnerable to various side-channel attacks and fault injection attacks, and many countermeasures have been proposed. However, selecting and integrating a set of countermeasures targeting multiple attacks into an ECC design is far from trivial. Security, performance and cost need to be considered together. In this paper, we describe a g...
متن کاملOptimizing the Control Hierarchy of an ECC Coprocessor Design on an FPGA Based SoC Platform
Most hardware/software codesigns of Elliptic Curve Cryptography only have one central control unit, typically a 32 bit or 8 bit processor core. With the ability of integrating several soft processor cores into one FPGA fabric, we can have a hierarchy of controllers in one SoC design. Compared to the previous codesigns trying to optimize the communication overhead between the central control uni...
متن کامل